Parallel algorithms for planar graph isomorphism and related problems
نویسندگان
چکیده
منابع مشابه
Linear time algorithms for Abelian group isomorphism and related problems
We consider the problem of determining if two finite groups are isomorphic. The groups are assumed to be represented by their multiplication tables. We present an O(n) algorithm that determines if two Abelian groups with n elements each are isomorphic. This improves upon the previous upper bound of O(n log n) [23] known for this problem. We solve a more general problem of computing the orders o...
متن کاملMinimum Circuit Size, Graph Isomorphism, and Related Problems
We study the computational power of deciding whether a given truth-table can be described by a circuit of a given size (the Minimum Circuit Size Problem, or MCSP for short), and of the variant denoted as MKTP where circuit size is replaced by a polynomially-related Kolmogorov measure. All prior reductions from supposedly-intractable problems to MCSP / MKTP hinged on the power of MCSP / MKTP to ...
متن کاملOn spectral properties for graph matching and graph isomorphism problems
Problems related to graph matching and isomorphisms are very important both from a theoretical and practical perspective, with applications ranging from image and video analysis to biological and biomedical problems. The graph matching problem is challenging from a computational point of view, and therefore different relaxations are commonly used. Although common relaxations techniques tend to ...
متن کاملParallel Algorithms for the K Shortest Paths and Related Problems Parallel Algorithms for the K Shortest Paths and Related Problems
A parallel algorithm is developed to nd the k shortest paths between pairs of vertices in an edge-weighted directed graph. The concurrent-read exclusive-write PRAM is used as the model of computation. The algorithm computes an implicit representation of the k shortest paths to a given destination vertex from each vertex of a graph with n vertices and m edges, using O(m + nk log 2 k) work and O(...
متن کاملA Global Constraint for Graph Isomorphism Problems
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very straightforward way, so that one can use constraint programming to solve it. However, constraint programming is a generic tool that may be less efficient than dedicated algorithms which can take advantage of the global sem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Circuits and Systems
سال: 1988
ISSN: 0098-4094
DOI: 10.1109/31.1743